A Provably Correct and Robust Algorithm for Convolutive Nonnegative Matrix Factorization
نویسندگان
چکیده
منابع مشابه
Speech enhancement using convolutive nonnegative matrix factorization with cosparsity regularization
A novel method for speech enhancement based on Convolutive Non-negative Matrix Factorization (CNMF) is presented in this paper. The sparsity of activation matrix for speech components has already been utilized in NMF-based enhancement methods. However such methods do not usually take into account prior knowledge about occurrence relations between different speech components. By introducing the ...
متن کاملAdditive Update Algorithm for Nonnegative Matrix Factorization
Abstract—Nonnegative matrix factorization (NMF) is an emerging technique with a wide spectrum of potential applications in data analysis. Mathematically, NMF can be formulated as a minimization problem with nonnegative constraints. This problem is currently attracting much attention from researchers for theoretical reasons and for potential applications. Currently, the most popular approach to ...
متن کاملA Convergent Algorithm for Bi-orthogonal Nonnegative Matrix Tri-Factorization
Abstract. We extend our previous work on a convergent algorithm for uni-orthogonal nonnegative matrix factorization (UNMF) to the case where the data matrix is decomposed into three factors with two of them are constrained orthogonally and the third one is used to absorb the approximation error. Due to the way the factorization is performed, we name it as bi-orthogonal nonnegative matrix tri-fa...
متن کاملA Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملRobust Watermarking based on Subsampling and Nonnegative Matrix Factorization
This paper presents a novel robust digital image watermarking scheme using subsampling and nonnegative matrix factorization. Firstly, subsampling is used to construct a subimage sequence. Then, based on the column similarity of the subimage sequence, nonnegative matrix factorization (NMF) is applied to decompose the sequence. A Gaussian pseudo-random watermark sequence is embedded in the factor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2020
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2020.2984163